See uptree on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "up",
"3": "tree"
},
"expansion": "up- + tree",
"name": "pre"
}
],
"etymology_text": "From up- + tree.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "uptree (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"antonyms": [
{
"word": "downtree"
}
],
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "46 54",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "49 51",
"kind": "other",
"name": "English terms prefixed with up-",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Higher in a tree data structure."
],
"id": "en-uptree-en-adj-ocU3zUiR",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"tree",
"tree"
],
[
"data structure",
"data structure"
]
],
"raw_glosses": [
"(computing theory) Higher in a tree data structure."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "uptree"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "up",
"3": "tree"
},
"expansion": "up- + tree",
"name": "pre"
}
],
"etymology_text": "From up- + tree.",
"forms": [
{
"form": "uptrees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "uptree (plural uptrees)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "46 54",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "49 51",
"kind": "other",
"name": "English terms prefixed with up-",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "46 54",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "47 53",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "1986, Wei-Tek Tsai, Control and Management of Large and Dynamic Networks, page 73:",
"text": "The principal idea of [JAF 82] is that nodes do not start to update their routing table until all nodes in uptrees are notified.",
"type": "quote"
},
{
"ref": "2006, Association for Computing Machinery, Twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, page 241:",
"text": "The maximum number of such left or right up-trees that we could scan is O(log N).",
"type": "quote"
}
],
"glosses": [
"A subtree of a tree data structure that is rooted at a child of the current node (where the root node is considered to be the bottom of a tree)."
],
"id": "en-uptree-en-noun-oBGXpL0c",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory) A subtree of a tree data structure that is rooted at a child of the current node (where the root node is considered to be the bottom of a tree)."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "uptree"
}
{
"categories": [
"English adjectives",
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English terms prefixed with up-",
"English uncomparable adjectives",
"Pages with 1 entry",
"Pages with entries"
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "up",
"3": "tree"
},
"expansion": "up- + tree",
"name": "pre"
}
],
"etymology_text": "From up- + tree.",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "uptree (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"antonyms": [
{
"word": "downtree"
}
],
"categories": [
"en:Theory of computing"
],
"glosses": [
"Higher in a tree data structure."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"tree",
"tree"
],
[
"data structure",
"data structure"
]
],
"raw_glosses": [
"(computing theory) Higher in a tree data structure."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "uptree"
}
{
"categories": [
"English adjectives",
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English terms prefixed with up-",
"English uncomparable adjectives",
"Pages with 1 entry",
"Pages with entries"
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "up",
"3": "tree"
},
"expansion": "up- + tree",
"name": "pre"
}
],
"etymology_text": "From up- + tree.",
"forms": [
{
"form": "uptrees",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "uptree (plural uptrees)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English terms with quotations",
"Quotation templates to be cleaned",
"en:Theory of computing"
],
"examples": [
{
"ref": "1986, Wei-Tek Tsai, Control and Management of Large and Dynamic Networks, page 73:",
"text": "The principal idea of [JAF 82] is that nodes do not start to update their routing table until all nodes in uptrees are notified.",
"type": "quote"
},
{
"ref": "2006, Association for Computing Machinery, Twenty-fifth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, page 241:",
"text": "The maximum number of such left or right up-trees that we could scan is O(log N).",
"type": "quote"
}
],
"glosses": [
"A subtree of a tree data structure that is rooted at a child of the current node (where the root node is considered to be the bottom of a tree)."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
]
],
"raw_glosses": [
"(computing theory) A subtree of a tree data structure that is rooted at a child of the current node (where the root node is considered to be the bottom of a tree)."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "uptree"
}
Download raw JSONL data for uptree meaning in All languages combined (2.8kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.